Détection de bateaux dans les images de radar à ouverture synthétique

Le but principal de cette thèse est de développer des algorithmes efficaces et de concevoir un système pour la détection de bateaux dans les images Radar à Ouverture Synthetique (ROS.) Dans notre cas, la détection de bateaux implique en premier lieu la détection de cibles de points dans les images ROS. Ensuite, la détection d'un bateau proprement dit dépend des propriétés physiques du bateau lui-même, tel que sa taille, sa forme, sa structure, son orientation relative a la direction de regard du radar et les conditions générales de l'état de la mer. Notre stratégie est de détecter toutes les cibles de bateaux possibles dans les images de ROS, et ensuite de chercher autour de chaque candidat des évidences telle que les sillons. Les objectifs de notre recherche sont (1) d'améliorer 1'estimation des paramètres dans Ie modèle de distribution-K et de déterminer les conditions dans lesquelles un modèle alternatif (Ie Gamma, par exemple) devrait être utilise plutôt; (2) d'explorer Ie modèle PNN (Probabilistic Neural Network) comme une alternative aux modèles paramétriques actuellement utilises; (3) de concevoir un modèle de regroupement flou (FC : Fuzzy Clustering) capable de détecter les petites et grandes cibles de bateaux dans les images a un seul canal ou les images a multi-canaux; (4) de combiner la détection de sillons avec la détection de cibles de bateaux; (5) de concevoir un modèle de détection qui peut être utilisé aussi pour la détection des cibles de bateaux en zones costières.Abstract: The main purpose of this thesis is to develop efficient algorithms and design a system for ship detection from Synthetic Aperture Radar (SAR) imagery. Ship detection usually involves through detection of point targets on a radar clutter background.The detection of a ship depends on the physical properties of the ship itself, such as size, shape, and structure; its orientation relative to the radar look-direction; and the general condition of the sea state. Our strategy is to detect all possible ship targets in SAR images, and then search around each candidate for the wake as further evidence.The objectives of our research are (1) to improve estimation of the parameters in the K-distribution model and to determine the conditions in which an alternative model (Gamma, for example) should be used instead; (2) to explore a PNN (Probabilistic Neural Networks) model as an alternative to the commonly used parameteric models; (3) to design a FC (Fuzzy Clustering) model capable of detecting both small and large ship targets from single-channel images or multi-channel images; (4) to combine wake detection with ship target detection; (5) to design a detection model that can also be used to detect ship targets in coastal areas. We have developed algorithms for each of these objectives and integrated them into a system comprising six models.The system has been tested on a number of SAR images (SEASAT, ERS and RADARSAT-1, for example) and its performance has been assessed

SUR-Net: Predicting the Satisfied User Ratio Curve for Image Compression with Deep Learning

The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.The Satisfied User Ratio (SUR) curve for a lossy image compression scheme, e.g., JPEG, characterizes the probability distribution of the Just Noticeable Difference (JND) level, the smallest distortion level that can be perceived by a subject. We propose the first deep learning approach to predict such SUR curves. Instead of the direct approach of regressing the SUR curve itself for a given reference image, our model is trained on pairs of images, original and compressed. Relying on a Siamese Convolutional Neural Network (CNN), feature pooling, a fully connected regression-head, and transfer learning, we achieved a good prediction performance. Experiments on the MCL-JCI dataset showed a mean Bhattacharyya distance between the predicted and the original JND distributions of only 0.072

Human-induced vibration serviceability of arch pre-stressed concrete truss system

Human-induced vibration has become a serious serviceability problem due to the larger opening of girder, lighter floor systems and longer spans designed and used in practice. Vibration tests were undertaken in laboratory to research the vibrational characteristics of the arch pre-stressed concrete truss (APT) system spanning 16.0 m. Results from ambient vibration, impulse excitations (heel-drop and jumping) and steady-state incentives (walking and running) were presented. Dynamic characteristics such as natural frequencies, damping ratios, mode shapes and acceleration responses were studied and checked against the existing codes. Experimental results show that the investigated APT girder possesses high fundamental frequency and low damping ratio. Moreover, the perception factors based on the root-mean-square acceleration, vibration dose value (VDV) and psychological comfort data were obtained. Lastly, the threshold accelerations and VDVs were suggested for evaluating the human-induced vibration

Reducing Spurious Correlations for Aspect-Based Sentiment Analysis with Variational Information Bottleneck and Contrastive Learning

Deep learning techniques have dominated the literature on aspect-based sentiment analysis (ABSA), yielding state-of-the-art results. However, these deep models generally suffer from spurious correlation problems between input features and output labels, which creates significant barriers to robustness and generalization capability. In this paper, we propose a novel Contrastive Variational Information Bottleneck framework (called CVIB) to reduce spurious correlations for ABSA. The proposed CVIB framework is composed of an original network and a self-pruned network, and these two networks are optimized simultaneously via contrastive learning. Concretely, we employ the Variational Information Bottleneck (VIB) principle to learn an informative and compressed network (self-pruned network) from the original network, which discards the superfluous patterns or spurious correlations between input features and prediction labels. Then, self-pruning contrastive learning is devised to pull together semantically similar positive pairs and push away dissimilar pairs, where the representations of the anchor learned by the original and self-pruned networks respectively are regarded as a positive pair while the representations of two different sentences within a mini-batch are treated as a negative pair. To verify the effectiveness of our CVIB method, we conduct extensive experiments on five benchmark ABSA datasets and the experimental results show that our approach achieves better performance than the strong competitors in terms of overall prediction performance, robustness, and generalization

A Day-ahead Optimal Economic Dispatch Schedule for Multi Energy Interconnected Region

AbstractThe energy supply center of the multi energy interconnected region is an energy station, which contains many types of energy supply equipment to match the cold, heating and power loads. This paper proposed a day-ahead optimal economic dispatch model for multi energy interconnected region based on centralized and interconnected energy exchange framework. In the model, the constraints of regional network topology are taken into account. The model is solved by the interior point method in this paper. A case study shows that by performing the schedule made by the dispatch model, the daily operation cost of the multi energy interconnected region decreasing remarkably, thus demonstrates the effectiveness of the proposed economic dispatch schedule

A Unified Object Counting Network with Object Occupation Prior

The counting task, which plays a fundamental role in numerous applications (e.g., crowd counting, traffic statistics), aims to predict the number of objects with various densities. Existing object counting tasks are designed for a single object class. However, it is inevitable to encounter newly coming data with new classes in our real world. We name this scenario as \textit{evolving object counting}. In this paper, we build the first evolving object counting dataset and propose a unified object counting network as the first attempt to address this task. The proposed model consists of two key components: a class-agnostic mask module and a class-incremental module. The class-agnostic mask module learns generic object occupation prior via predicting a class-agnostic binary mask (e.g., 1 denotes there exists an object at the considering position in an image and 0 otherwise). The class-incremental module is used to handle new coming classes and provides discriminative class guidance for density map prediction. The combined outputs of class-agnostic mask module and image feature extractor are used to predict the final density map. When new classes come, we first add new neural nodes into the last regression and classification layers of class-incremental module. Then, instead of retraining the model from scratch, we utilize knowledge distillation to help the model remember what have already learned about previous object classes. We also employ a support sample bank to store a small number of typical training samples of each class, which are used to prevent the model from forgetting key information of old data. With this design, our model can efficiently and effectively adapt to new coming classes while keeping good performance on already seen data without large-scale retraining. Extensive experiments on the collected dataset demonstrate the favorable performance.Comment: Under review; The dataset and code will be available at: https://github.com/Tanyjiang/EOC

Teacher Agent: A Non-Knowledge Distillation Method for Rehearsal-based Video Incremental Learning

With the rise in popularity of video-based social media, new categories of videos are constantly being generated, creating an urgent need for robust incremental learning techniques for video understanding. One of the biggest challenges in this task is catastrophic forgetting, where the network tends to forget previously learned data while learning new categories. To overcome this issue, knowledge distillation is a widely used technique for rehearsal-based video incremental learning that involves transferring important information on similarities among different categories to enhance the student model. Therefore, it is preferable to have a strong teacher model to guide the students. However, the limited performance of the network itself and the occurrence of catastrophic forgetting can result in the teacher network making inaccurate predictions for some memory exemplars, ultimately limiting the student network's performance. Based on these observations, we propose a teacher agent capable of generating stable and accurate soft labels to replace the output of the teacher model. This method circumvents the problem of knowledge misleading caused by inaccurate predictions of the teacher model and avoids the computational overhead of loading the teacher model for knowledge distillation. Extensive experiments demonstrate the advantages of our method, yielding significant performance improvements while utilizing only half the resolution of video clips in the incremental phases as input compared to recent state-of-the-art methods. Moreover, our method surpasses the performance of joint training when employing four times the number of samples in episodic memory.Comment: Under review; Do We Really Need Knowledge Distillation for Class-incremental Video Learning

Improved Machine Learning-Based Predictive Models for Breast Cancer Diagnosis

Breast cancer death rates are higher than any other cancer in American women. Machine learning-based predictive models promise earlier detection techniques for breast cancer diagnosis. However, making an evaluation for models that efficiently diagnose cancer is still challenging. In this work, we proposed data exploratory techniques (DET) and developed four different predictive models to improve breast cancer diagnostic accuracy. Prior to models, four-layered essential DET, e.g., feature distribution, correlation, elimination, and hyperparameter optimization, were deep-dived to identify the robust feature classification into malignant and benign classes. These proposed techniques and classifiers were implemented on the Wisconsin Diagnostic Breast Cancer (WDBC) and Breast Cancer Coimbra Dataset (BCCD) datasets. Standard performance metrics, including confusion matrices and K-fold cross-validation techniques, were applied to assess each classifier’s efficiency and training time. The models’ diagnostic capability improved with our DET, i.e., polynomial SVM gained 99.3%, LR with 98.06%, KNN acquired 97.35%, and EC achieved 97.61% accuracy with the WDBC dataset. We also compared our significant results with previous studies in terms of accuracy. The implementation procedure and findings can guide physicians to adopt an effective model for a practical understanding and prognosis of breast cancer tumors.publishedVersio

Learning-based Satisfied User Ratio Prediction for Symmetrically and Asymmetrically Compressed Stereoscopic Images

The file attached to this record is the author's final peer reviewed version.The Satisfied User Ratio (SUR) for a given distortion level is the fraction of subjects that cannot perceive a quality difference between the original image and its compressed version. By predicting the SUR, one can determine the highest distortion level which allows to save bit rate while guaranteeing a good visual quality. We propose the first method to predict the SUR for symmetrically and asymmetrically compressed stereoscopic images. Unlike SUR prediction techniques for 2D images and videos, our method exploits the properties of binocular vision. We first extract features that characterize image quality and image content. Then, we use gradient boosting decision trees to reduce the number of features and train a regression model that learns a mapping function from the features to the SUR values. Experimental results on the SIAT-JSSI and SIAT-JASI datasets show high SUR prediction accuracy for H.265 All-Intra and JPEG2000 symmetrically and asymmetrically compressed stereoscopic images